Path Coverings with Prescribed Ends in Faulty Hypercubes
نویسندگان
چکیده
We discuss the existence of vertex disjoint path coverings with prescribed ends for the n-dimensional hypercube with or without deleted vertices. Depending on the type of the set of deleted vertices and desired properties of the path coverings we establish the minimal integer m such that for every n ≥ m such path coverings exist. Using some of these results, for k ≤ 4, we prove Locke’s conjecture that a hypercube with k deleted vertices of each parity is Hamiltonian if n ≥ k + 2. Some of our lemmas substantially generalize known results of I. Havel and T. Dvořák. At the end of the paper we formulate some conjectures supported
منابع مشابه
Hamiltonian Laceability of Hypercubes with Faults of Charge One
In 2007, in their paper Path coverings with prescribed ends in faulty hypercubes, N. Castañeda and I. Gotchev formulated the following conjecture: Let n and k be positive integers with n ≥ k + 3 and F be a set of k even (odd) and k + 1 odd (even) vertices in the binary hypercube Qn. If u1 and u2 are two distinct even (odd) vertices inQn − F then forQn − F there exists a Hamiltonian path that co...
متن کاملHamiltonian Laceability of Hypercubes with Faults of Charge One
In 2007, in their paper Path coverings with prescribed ends in faulty hypercubes, N. Castañeda and I. Gotchev formulated the following conjecture: Let n and k be positive integers with n ≥ k + 3 and F be a set of k even (odd) and k + 1 odd (even) vertices in the binary hypercube Qn. If u1 and u2 are two distinct even (odd) vertices inQn − F then forQn − F there exists a Hamiltonian path that co...
متن کاملProof of Locke’s Conjecture, I
Locke’s conjecture (L) states that the binary hypercube Qn with k deleted vertices of each parity is Hamiltonian if n ≥ k + 2. In 2003, S. C. Locke and R. Stong published in The American Mathematical Monthly a proof of (L) for the case k = 1. In 2007, in the paper Path coverings with prescribed ends in faulty hypercubes the authors proved (L) for every k ≤ 4 and formulated the following conject...
متن کاملPrescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
Ruskey and Savage asked the following question: Does every matching of Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? J. Fink showed that the question is true for every perfect matching, and solved the Kreweras’ conjecture. In this paper we consider the question in hypercubes with faulty edges. We show that every matching M of at most 2n− 1 edges can be extended to a Hamiltonian cycle of Qn ...
متن کاملEmbedded paths and cycles in faulty hypercubes
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists a cycle of length at least 2 − 2f in the complement of F . Until recently, exact values of fn were known only for n ≤ 4, and the best lower bound available for fn with n ≥ 5 was 2n−4. We prove that f5 = 8 and obtain the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015